# 自己的双指针做法
class Solution:
    def findContentChildren(self, g: List[int], s: List[int]) -> int:
        s.sort()
        g.sort()
        count = 0
        kid = 0
        biscuit = 0
        while kid < len(g) and biscuit < len(s):
            if g[kid] <= s[biscuit]:
                count += 1
                kid += 1
                biscuit += 1
            else:
                biscuit += 1
        return count